Polyominoes with Nearly Convex Columns: an Undirected Model

نویسندگان

  • Svjetlan Feretić
  • Anthony J. Guttmann
  • A. J. GUTTMANN
چکیده

Column-convex polyominoes were introduced in 1950’s by Temperley, a mathematical physicist working on “lattice gases”. By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of column-convex polyominoes. However, the enumeration by area has been done for only one of the said generalizations, namely for multi-directed animals. In this paper, we introduce a new sequence of supersets of column-convex polyominoes. Our model (we call it level m column-subconvex polyominoes) is defined in a simple way: every column has at most two connected components and, if there are two connected components, the gap between them consists of at most m cells. We focus on the case when cells are hexagons and we compute the area generating functions for the levels one and two. Both of those generating functions are q-series, whereas the area generating function of column-convex polyominoes is a rational function. The growth constants of level one and level two column-subconvex polyominoes are 4.319139 and 4.509480, respectively. For comparison, the growth constants of column-convex polyominoes, multi-directed animals and all polyominoes are 3.863131, 4.587894 and 5.183148, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polyominoes with nearly convex columns: A semi-directed model

Column-convex polyominoes are by now a well-explored model. So far, however, no attention has been given to polyominoes whose columns can have either one or two connected components. This little known kind of polyominoes seems not to be manageable as a whole. To obtain solvable models, one needs to introduce some restrictions. This paper is focused on polyominoes with hexagonal cells. The restr...

متن کامل

Reconstruction of 2-convex polyominoes

There are many notions of discrete convexity of polyominoes (namely hvconvex [1], Q-convex [2], L-convex polyominoes [5]) and each one has been deeply studied. One natural notion of convexity on the discrete plane leads to the definition of the class of hv-convex polyominoes, that is polyominoes with consecutive cells in rows and columns. In [1] and [6], it has been shown how to reconstruct in ...

متن کامل

Reconstruction of convex polyominoes from orthogonal projections of their contours

The problem of reconstructing a convex polyominoes from its horizontal and vertical projections when the projections are defined as the number of cells of the polyomino in the different lines and columns was studied by Del Lungo and M. Nivat (cf [7]). In this paper we study the reconstruction of any convex polyomino when the orthogonal projections are defined as the contour length of the object...

متن کامل

Two generalizations of column-convex polygons

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, . . . , p connected components. Then columnconvex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simpl...

متن کامل

A Bijection for Directed-Convex Polyominoes

In this paper we consider two classes of lattice paths on the plane which use north, east, south, and west unitary steps, beginning and ending at 0 0 . We enumerate them according to the number of steps by means of bijective arguments; in particular, we apply the cycle lemma. Then, using these results, we provide a bijective proof for the number of directed-convex polyominoes having a fixed num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009